On AB bond percolation on the square lattice and AB site percolation on its line graph
نویسنده
چکیده
We prove that AB site percolation occurs on the line graph of the square lattice when p ∈ (1− √ 1− pc, √ 1− pc), where pc is the critical probability for site percolation in Z. Also, we prove that AB bond percolation does not occur on Z for p = 1 2 .
منابع مشابه
Comment on ‘Topology invariance in percolation thresholds’
In a recent article, Galam and Mauger proposed an invariant for site and bond percolation thresholds, based on known values for twenty lattices (Eur. Phys. J. B 1 (1998) 255–258). Here we give a larger list of values for more than forty lattices in two to six dimensions. The list contains examples of lattices with equal site percolation thresholds, but different bond percolation thresholds. The...
متن کاملThe lowest crossing in 2 D critical percolation
We study the following problem for critical site percolation on the triangular lattice. Let A and B be sites on a horizontal line e separated by distance n. Consider, in the half-plane above e, the lowest occupied crossing Rn from the half-line left of A to the half-line right of B. We show that the probability that Rn has a site at distance smaller than m from AB is of order (log(n/m)), unifor...
متن کاملLow-density series expansions for directed percolation: I. A new efficient algorithm with applications to the square lattice
A new algorithm for the derivation of low-density series for percolation on directed lattices is introduced and applied to the square lattice bond and site problems. Numerical evidence shows that the computational complexity grows exponentially, but with a growth factor λ < 8 √ 2, which is much smaller than the growth factor λ = 4 √2 of the previous best algorithm. For bond (site) percolation o...
متن کاملFast Monte Carlo algorithm for site or bond percolation.
We describe in detail an efficient algorithm for studying site or bond percolation on any lattice. The algorithm can measure an observable quantity in a percolation system for all values of the site or bond occupation probability from zero to one in an amount of time that scales linearly with the size of the system. We demonstrate our algorithm by using it to investigate a number of issues in p...
متن کاملHistogram Monte Carlo Position-Space Renormalization Group: Applications to the Site Percolation
We study site percolation on the square lattice and show that, when augmented with histogram Monte Carlo simulations for large lattices, the cell-to-cell renormalization group approach can be used to determine the critical probability accurately. Unlike the cell-to-site method and an alternate renormalization group approach proposed recently by Sahimi and Rassamdana, both of which rely on ab in...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004